Network design with probabilistic capacities
نویسندگان
چکیده
منابع مشابه
Single-commodity network design with random edge capacities
This paper examines the single-commodity network design problem with stochastic edge capacities. We characterize the structures of the optimal designs and compare with the deterministic counterparts. We do this partly to understand what constitutes robust network designs, but also to construct a heuristic for the stochastic problem, leading to optimality gaps of about 10%. In our view, that is ...
متن کاملNetwork Bargaining with General Capacities
We study balanced solutions for network bargaining games with general capacities, where agents can participate in a fixed but arbitrary number of contracts. We provide the first polynomial time algorithm for computing balanced solutions for these games. In addition, we prove that an instance has a balanced solution if and only if it has a stable one. Our methods use a new idea of reducing an in...
متن کاملThe Probabilistic Network Design Problem
We analyze the probabilistic variation of the multicommodity discrete network design problem named the probabilistic network design problem in which the commodities are generated probabilistically and the objective is to calculate the expected value of all possible network design instances. We extend the a priori strategy which has been successfully applied to the probabilistic variations of th...
متن کاملA mathematical model for sustainable probabilistic network design problem with construction scheduling considering social and environmental issues
Recent facility location allocation problems are engaged with social, environmental and many other aspects, besides cost objectives.Obtaining a sustainable solution for such problems requires development of new mathematical modeling and optimization algorithms. In this paper, an uncapacitated dynamic facility location-network design problem with random budget constraints is considered. Social i...
متن کاملProbabilistic Tabu Search for Telecommunications Network Design
This paper presents a computational study of a network design problem arising in the telecommunication industry. The objective can be formulated as that of nding an optimal degree constrained Steiner tree in a graph whose nodes and edges are weighted by costs. We develop a probabilistic Tabu Search heuristic for this problem, addressing issues of move evaluations, error correction, tabu memorie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2017
ISSN: 0028-3045
DOI: 10.1002/net.21769